A graph model for object oriented programming
نویسندگان
چکیده
منابع مشابه
A Computational Model for Object Oriented Programming
We describe a computational model for object oriented programs. A state of a computation is a directed graph in which each vertex represents an object and each edge represents an instance variable. Edges are labeled with instance variable names. We introduce a simple object oriented language and define a semantics which gives the meaning of each program as a function from states to states. Char...
متن کاملA Graph-based Semantics For Object-oriented Programming Constructs
This paper presents a graph-based formalism for object-oriented class structure specifications. The formalism combines labelled graphs with partial orders, to adequately model the (single) inheritance relation among objects and the overriding relation between methods within derived classes. The semantics of system extension by inheritance and aggregation is then defined as colimits in a suitabl...
متن کاملA Student Model for Object-oriented Design and Programming
Objects-first” is an increasingly popular strategy for teaching objectoriented programming by introducing the concepts of objects, classes, and instances before procedural elements of a programming language. Learning object-oriented design and programming is a challenging task for many beginning students. We represent CIMEL ITS, which is an intelligent tutoring system that provides one-on-one t...
متن کاملA Highly Parallel Model for Object-Oriented Concurrent Constraint Programming
Two of the currently most promising programming paradigms, namely Object-Oriented Programming and Concurrent Constraint Programming are combined into a single, highly parallel computational model based on Term Graph Rewriting Systems. In particular, we show how multi-headed Term Graph rewrite rules provide a powerful tool able to manipulate Term Graphs which themselves represent in a homogeneou...
متن کاملA Statically Verifiable Programming Model for Concurrent Object-Oriented Programs
Reasoning about multithreaded object-oriented programs is difficult, due to the non-local nature of object aliasing, data races, and deadlocks. We propose a programming model that prevents data races and deadlocks, and supports local reasoning in the presence of object aliasing and concurrency. Our programming model builds on the multithreading and synchronization primitives as they are present...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 1994
ISSN: 0362-1340,1558-1160
DOI: 10.1145/181593.181596